基于空间约束的舰载机出库调度

舰载机在航母上的调度问题是制约舰载机出动和回收的重要因素,以往研究主要集中在飞行甲板调度方面。针对舰载机在航母上的出入库问题进行研究,着力解决舰载机在航母上二、三波次的出动能力。首先对舰载机出库的流程进行分析,梳理制约因素。其次,应用柔性流水车间调度理论对空间约束条件下的舰载机出库调度问题进行建模。再次,对智能粒子群算法应用于舰载机出库调度问题进行分析,对编码进行设计,并给出算法流程。最后,对出库流程进行仿真,计算出最优出库方案及时间,验证了模型的准确性。     

Linking a throughput simulation to a systems dynamics simulation to assess the utility of a US Navy foreign humanitarian aid mission

The success of any humanitarian aid mission is generally measured by the timeliness of critical supplies that are delivered to the affected area. However, a more interesting analysis may be to determine the effect of the aid on the overall satisfaction of the local population. The authors' research focused on the delivery of humanitarian aid to a notional region that was decimated by flooding with ships, landing craft and security personnel provided by the US Navy and Marines. While the research effort addressed naval force structure, the focus of the research was: (1) to assess different delivery methods for the aid; and (2) to determine how the aid delivery impacted the overall satisfaction of the local population. To examine both concerns, two simulation models were developed, with one examining the throughput of aid delivered during the operation, and the other the satisfaction of the population based on the humanitarian aid effort.     

Evaluating appointment postponement in scheduling patients at a diagnostic clinic

Diagnostic clinics are among healthcare facilities that suffer from long waiting times which can worsen medical outcomes and increase patient no-shows. Reducing waiting times without significant capital investments is a challenging task. We tackle this challenge by proposing a new appointment scheduling policy that does not require significant investments for diagnostic clinics. The clinic in our study serves outpatients, inpatients, and emergency patients. Emergency patients must be seen on arrival, and inpatients must be given next day appointments. Outpatients, however, can be given later appointments. The proposed policy takes advantage of this by allowing the postponement of the acceptance of appointment requests from outpatients. The appointment scheduling process is modeled as a two-stage stochastic programming problem where a portion of the clinic capacity is allocated to inpatients and emergency patients in the first stage. In the second stage, outpatients are scheduled based on their priority classes. After a detailed analysis of the solutions obtained from the two-stage stochastic model, we develop a simple, non-anticipative policy for patient scheduling. We evaluate the performance of this proposed, easy-to-implement policy in a simulation study which shows significant improvements in outpatient indirect waiting times.     

动态性警卫勤务卫星通信保障非技术性障碍及对策

卫星通信技术为警卫勤务的通信保障提供了可靠的技术平台,但临时现场、临时住地以及路线等动态性警卫勤务的通信保障问题一直没有得到较好地解决,动态性警卫勤务中应用卫星通信还存在着一些非技术层面的障碍。阐述了动态性警卫勤务运用卫星通信保障的必要性和可行性,分析了动态性警卫勤务卫星通信保障非技术性障碍,提出了消除动态性警卫勤务卫星通信保障非技术性障碍的对策。     

Scheduling twin robots on a line

This article introduces the twin robots scheduling problem (TRSP), in which two robots positioned at the opposite ends of a rail are required to deliver items to positions along the rail, and the objective is to minimize the makespan. A proof of ‐hardness of the TRSP is presented, along with exact and heuristic algorithms. Computational results on challenging instances are provided.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 119–130, 2014     

Maintenance scheduling for modular systems: Modeling and algorithms

We study new models of scheduled maintenance management for modular systems, consisting of multiple components with respective cycle limits. The cycle limit of each component specifies the time interval in which this component must be repaired or replaced. The goal is to compute a feasible maintenance schedule that minimizes the cost associated with component maintenance. Applications of these models arise in Air Force aircraft maintenance as well as in other arenas with required preventive maintenance. The typical cost structures that arise in practical settings are submodular, which make the resulting models computationally challenging. We develop two efficient and operationally tenable approximation algorithms. We prove constant factor worst‐case guarantees for both algorithms, and present computational experiments showing that these algorithms perform within a few percent of optimality on operationally relevant instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 472–488, 2014     

北斗GEO卫星用户算法的改进方法研究*

针对北斗GEO用户算法需要进行5?倾角的坐标旋转处理这一过程,本文提出了采用经典广播星历参数用户算法直接解算北斗GEO卫星位置的改进方法,并同时给出了相应的基于第二类无奇点根数的广播星历拟合算法。该算法采用第二类无奇点轨道根数代替经典轨道根数,解决了由GEO轨道的小倾角特性引起的经典广播星历参数拟合过程中法化矩阵奇异的问题。从而避免了北斗GEO用户算法中坐标旋转处理过程,减少了GEO用户算法的计算步骤。经过仿真验证,本文提出的改进方法在卫星轨道拟合过程中与原算法精度相当;在卫星轨道外推过程中与原算法相比略有精度损失,但仍满足用户导航定位精度的需求。最后,采用实际北斗GEO星历解算的轨道数据验证了改进算法的有效性。     

基于DoDAF与Petri网的预警卫星系统建模分析

预警卫星系统在弹道导弹防御系统中处在最前沿,在战争中起着其他装备无法替代的作用。依据DoDAF和预警卫星系统的作战流程,构建了预警卫星系统作战状态转换(OV-6b)模型,以描述预警卫星系统作战过程的时序关系、各作战节点的状态转换以及信息流关系。基于Petri网将各节点OV-6b模型转换成可执行模型进行驱动,并构建和分析了各Petri网模型的可达图,结果表明,建立的OV-6b模型和Petri网模型是合理的、正确的。     

一种装甲车辆CAN总线混合调度算法

针对当前装甲车辆综合电子系统节点消息传输不公平、紧急消息传输不及时等缺点,结合某型车辆消息紧急度和截止期,按照分层处理原则对总线协议进行了改进,提出了"分级决策动态均衡"的混合调度算法,并通过试验验证了算法的可行性和有效性。     

The quay crane scheduling problem with time windows

The quay crane scheduling problem consists of scheduling tasks for loading and unloading containers on cranes that are assigned to a vessel for its service. This article introduces a new approach for quay crane scheduling, where the availability of cranes at a vessel is restricted to certain time windows. The problem is of practical relevance, because container terminal operators frequently redeploy cranes among vessels to speed up the service of high‐priority vessels while serving low‐priority vessels casually. This article provides a mathematical formulation of the problem and a tree‐search‐based heuristic solution method. A computational investigation on a large set of test instances is used to evaluate the performance of the heuristic and to identify the impact of differently structured crane time windows on the achievable vessel handling time. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011